The Number of Halving Circles
نویسنده
چکیده
1. INTRODUCTION. We say that a set S of 2n + 1 points in the plane is in general position if no three of the points are collinear and no four are concyclic. We call a circle halving with respect to S if it has three points of S on its circumference, n − 1 points in its interior, and n − 1 in its exterior. The goal of this paper is to prove the following surprising fact: any set of 2n + 1 points in general position in the plane has exactly n 2 halving circles. Our starting point is the following problem, which appeared in the 1962 Chinese Mathematical Olympiad [7].
منابع مشابه
Bivariate mean value interpolation on circles of the same radius
We consider bivariate mean-value interpolationproblem, where the integrals over circles are interpolation data. In this case the problem is described over circles of the same radius and with centers are on astraight line and it is shown that in this case the interpolation is not correct.
متن کاملQuaternionic Product of Circles and Cycles and Octonionic Product for Pairs of Circles
This paper concerns with a product of circles induced by the quaternionic product considered in a projective manner. Several properties of this composition law are derived and on this way we arrive at some special numbers as roots or powers of unit. We extend this product to cycles as oriented circles and to pairs of circles by using the algebra of octonions. Three applications of the given pro...
متن کاملElastic Behavior of Functionally Graded Two Tangled Circles Chamber
This paper presents the numerical elastic solution for a real problem, functionally graded chamber of hydraulic gear pumps under internal pressure. Because of the similarity and complexity for the considering geometry, a bipolar cylindrical coordinate system is used to extract the governing equations. The material properties are considered to vary along the two tangled circles with a power-law ...
متن کاملHalving Lines and Their Underlying Graphs
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.
متن کاملHalving Point Sets
Given n points in R d , a hyperplane is called halving if it has at most bn=2c points on either side. How many partitions of a point set (into the points on one side, on the hyperplane, and on the other side) by halving hyperplanes can be realized by an n-point set in R d ? Consider the following algorithmic problem rst. Given n points in R d , we want to nd a hyperplane that minimizes the sum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 111 شماره
صفحات -
تاریخ انتشار 2004